VNP=VP in the multilinear world
نویسندگان
چکیده
In this note, we show that over fields of any characteristic, exponential sums of Boolean instantiations of polynomials computed by multilinear circuits can be computed by multilinear circuits with polynomial blow-up in size. In particular, multilinear-VNP equals multilinear-VP. Our result showing closure under exponential sums also holds for other restricted multilinear classes – polynomials computed by multilinear (bounded-width) algebraic branching programs and formulas. Furthermore, it holds even if the circuit class is not fully multilinear but computes a polynomial that is multilinear in the summation variables.
منابع مشابه
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit multilinear polynomial family {fm}m≥1 for arithmetic circuits. In this paper, a special case of CPIT is considered, namely non-singular matrix completion (NSMC) under a low-individual-degree promise. For this subclass ...
متن کاملBoundaries of VP and VNP
One fundamental question in the context of the geometric complexity theory approach to the VP vs. VNP conjecture is whether VP = VP, where VP is the class of families of polynomials that can be computed by arithmetic circuits of polynomial degree and size, and VP is the class of families of polynomials that can be approximated infinitesimally closely by arithmetic circuits of polynomial degree ...
متن کاملOn hardness of multilinearization, and VNP-completeness in characteristics two
For a boolean function f : {0, 1} → {0, 1}, let f̂ be the unique multilinear polynomial such that f(x) = f̂(x) holds for every x ∈ {0, 1}. We show that, assuming VP 6= VNP, there exists a polynomialtime computable f such that f̂ requires super-polynomial arithmetic circuits. In fact, this f can be taken as a monotone 2-CNF, or a product of affine functions. This holds over any field. In order to p...
متن کاملA Dichotomy Theorem for Homomorphism Polynomials
In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H . We show that this family is computable by arithmetic circuits in constant depth if H has a loop or no edge and that it is hard otherwise (i.e., complete for VNP, the arithmetic class related to #P ). We...
متن کاملAlmost Cubic Bound for Depth Three Circuits in VP
In "An almost Cubic Lower Bound for Depth Three Arithmetic Circuits", [KST16] present an infinite family of polynomials in VNP, {Pn}n∈Z+ on n variables with degree n such that every ∑∏∑ circuit computing Pn is of size Ω̃(n3). A similar result was proven in [BLS16] for polynomials in VP with lower bound Ω ( n3 2 p logn ) . We present a modified polynomial and perform a tighter analysis to obtain ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 116 شماره
صفحات -
تاریخ انتشار 2016